Fault-Tolerant Aggregation by Flow Updating
نویسندگان
چکیده
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed applications. In the particular case of wireless sensor networks, data collection is often only practicable if aggregation is performed. Several aggregation algorithms have been proposed in the last few years, exhibiting different properties in terms of accuracy, speed and communication tradeoffs. Nonetheless, existing approaches are found lacking in terms of fault tolerance. In this paper, we introduce a novel fault-tolerant averaging based data aggregation algorithm. It tolerates substantial message loss (link failures), while competing algorithms in the same class can be affected by a single lost message. The algorithm is based on manipulating flows (in the graph theoretical sense), that are updated using idempotent messages, providing it with unique robustness capabilities. Furthermore, evaluation results obtained by comparing it with other averaging approaches have revealed that it outperforms them in terms of time and message complexity.
منابع مشابه
Flow updating: Fault-tolerant aggregation for dynamic networks
Data aggregation is a fundamental building block of modern distributed systems. Averaging based approaches, commonly designated gossip-based, are an important class of aggregation algorithms as they allow all nodes to produce a result, converge to any required accuracy, and work independently from the network topology. However, existing approaches exhibit many dependability issues when used in ...
متن کاملUsing Less Links to Improve Fault-Tolerant Aggregation
Data aggregation1 plays a basal role in the design of scalable distributed applications [1], allowing the determination of meaningful system-wide properties to direct the execution of the system. For instance, aggregation can be used to estimate: the size of the network to dimension of Distributed Hash Table (DHT) structures [2], or to set a quorum in dynamic settings [3]; the average system lo...
متن کاملFault-Tolerant Multi-Agent Exact Belief Propagation
Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains, where agents (subdomains) are organized by a tree structure (called hypertree). In earlier work, all belief updating methods on a hypertree are made of two rounds of propagation, each of which is implemented as a recursive process. Both processes need to be started from ...
متن کاملScalable and fault tolerant orthogonalization based on randomized distributed data aggregation
The construction of distributed algorithms for matrix computations built on top of distributed data aggregation algorithms with randomized communication schedules is investigated. For this purpose, a new aggregation algorithm for summing or averaging distributed values, the push-flow algorithm, is developed, which achieves superior resilience properties with respect to failures compared to exis...
متن کاملFault-Tolerant Data Aggregation in Wireless Sensor Networks
Accurate information is most important in Wireless Sensor Networks (WSNs). Incorrect (faulty data) information makes wrong decision; it decreases the reliability in communication. Fault tolerance is one of the issues in WSNs .Proposed fault tolerant data aggregation scheme for identifying the faulty data sent by the sensors to the cluster head, where the aggregation is performed. Identified fau...
متن کامل